Rational approximation and arithmetic progressions
نویسندگان
چکیده
منابع مشابه
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold τ and oracle access to a function f , outputs (the frequencies and approximate values of) all the τ -significant Fourier coefficients of f , i.e., the Fourier coefficients whose magnitude exceeds τ‖f‖2. In this paper we present the first deterministic SFT algorithm for functions f over ZN which is: (1) Local, i.e., its running t...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملPrimes in arithmetic progressions
Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-type estimates in the prime number theorem for arithmetic progressions, for all moduli k ≤ 72 and other small moduli.
متن کاملArithmetic Progressions on Conics.
In this paper, we look at long arithmetic progressions on conics. By an arithmetic progression on a curve, we mean the existence of rational points on the curve whose x-coordinates are in arithmetic progression. We revisit arithmetic progressions on the unit circle, constructing 3-term progressions of points in the first quadrant containing an arbitrary rational point on the unit circle. We als...
متن کاملDistinct Distances and Arithmetic Progressions
According to a theorem of Szemerédi (1975), for every positive integer k and every δ > 0, there exists S = S(k, δ) such that every subset X of {1, 2, . . . , S} of size at least δS contains an arithmetic progression with k terms. Here we generalize the above result to any set of real numbers. For every positive integer k and every c > 0, there exists N = N(k, c) such that every set of n ≥ N poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2015
ISSN: 1793-0421,1793-7310
DOI: 10.1142/s1793042115500232